package question.solution25;

import java.util.Stack;

public class Solution25 {
    public ListNode reverseKGroup(ListNode head, int k) {
        Stack<ListNode> listNodeStack = new Stack<>();
        ListNode currentHead = head;
        do{
            for(int i=0;i<k;i++){
                ListNode nextNode = currentHead.next;
                currentHead.next=null;
                listNodeStack.push(currentHead);
            }
        }while(true);

    }

//    private ListNode reverseList(ListNode hNode,ListNode tNode){
//        ListNode tempNode = hNode.next;
//    }
}
